Problem - Dependent ORIGEN Library Compression to Increase Computational Efficiency
نویسندگان
چکیده
ORIGEN is a highly accurate code to model used fuel isotopic inventory evolution and associated radiation sources. The Oak Ridge Isotope Generation (ORIGEN) code is a depletion model to calculate neutron activation, actinide transmutation, fission product generation, and radiation source terms. This is done through analysis of the full isotopic transition matrix to solve the rate equations that describe the nuclide generation, depletion, and decay processes. This system tracks 2237 isotopes and 54331 transitions, making it the preeminent code for evaluating used nuclear fuel isotopic evolution and production in the world. A next-generation approach to using ORIGEN for accurate source term and depletion models is the direct incorporation of ORIGEN into larger frameworks that rely upon activation and depletion source terms via the modern ORIGEN Application Program Interface (API). However, many problems would benefit most from a reduction in the computational cost of directly performing depletion calculations via ORIGEN. The method to reduce computational cost presented in this paper relies on a lossy compression algorithm to reduce the ORIGEN reactor data library size. This is achieved by a reduction of the nuclides and transitions being tracked by elimination of nuclides and transitions unimportant for the specified problem, whether that is tracking decay heat, dose, or specific isotopic contents for depletion, resulting in a final library size of approximately 300-500 isotopes. These generated problem-specific libraries do not result in a significant sacrifice in accuracy by focusing on the determination of important contributing nuclides in a generalized manner such to enable reliable calculation of source terms without carrying the full transition matrix through the calculation. This method has been shown to potentially reduce run times and memory requirements by an order of magnitude.
منابع مشابه
Fast Intra Mode Decision for Depth Map coding in 3D-HEVC Standard
three dimensional- high efficiency video coding (3D-HEVC) is the expanded version of the latest video compression standard, namely high efficiency video coding (HEVC), which is used to compress 3D videos. 3D videos include texture video and depth map. Since the statistical characteristics of depth maps are different from those of texture videos, new tools have been added to the HEVC standard fo...
متن کاملLot Streaming in No-wait Multi Product Flowshop Considering Sequence Dependent Setup Times and Position Based Learning Factors
This paper considers a no-wait multi product flowshop scheduling problem with sequence dependent setup times. Lot streaming divide the lots of products into portions called sublots in order to reduce the lead times and work-in-process, and increase the machine utilization rates. The objective is to minimize the makespan. To clarify the system, mathematical model of the problem is presented. Sin...
متن کاملInvestigation of energy consumption reduction in multistage compression process and its solutions
During hot seasons the inlet temperature of Nitrogen increases, as a result compressor consumes more power for compressing a specific mass ratio of fluid and consequently total energy consumption of the compressor increases as well. In this research, a three stage centrifugal compressor with intercooler was modeled thermodynamically in order to decreases the energy consumption of the compressor...
متن کاملExtending the Radar Dynamic Range using Adaptive Pulse Compression
The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...
متن کاملA three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کامل